Robert Goldblatt Topological Proofs of Some Rasiowa - Sikorski Lemmas In memory of Leo Esakia
نویسندگان
چکیده
We give topological proofs of Görnemann’s adaptation to Heyting algebras of the Rasiowa-Sikorski Lemma for Boolean algebras; and of the Rauszer-Sabalski generalisation of it to distributive lattices. The arguments use the Priestley topology on the set of prime filters, and the Baire category theorem. This is preceded by a discussion of criteria for compactness of various spaces of subsets of a lattice, including spaces of filters, prime filters etc.
منابع مشابه
Quantified Modal Logic on the Rational Line
In the topological semantics for propositional modal logic, S4 is known to be complete for the class of all topological spaces, for the rational line, for Cantor space, and for the real line. In the topological semantics for quantified modal logic, QS4 is known to be complete for the class of all topological spaces, and for the family of subspaces of the irrational line. The main result of the ...
متن کاملRasiowa-Sikorski Deduction Systems: A Handy Tool for Computer Science Logics
A Rasiowa-Sikorski system is a sequence-type formalization of logics based on building decomposition trees of formulae labelled with sequences of formulae. Proofs are nite decomposition trees with leaves having \fundamental", valid labels. The system is dual to the tableau system. The author gives examples of applying the R-S formalism to various C.S and A.I. logic, including a logic for reason...
متن کاملAn Extension of the Lemma of Rasiowa and Sikorski
We prove an extension of the Lemma of Rasiowa and Sikorski and give some applications. Moreover, we analyze its relationship to corresponding results on the omission of types.
متن کاملOn the Blok-Esakia Theorem
We discuss the celebrated Blok-Esakia theorem on the isomorphism between the lattices of extensions of intuitionistic propositional logic and the Grzegorczyk modal system. In particular, we present the original algebraic proof of this theorem found by Blok, and give a brief survey of generalisations of the Blok-Esakia theorem to extensions of intuitionistic logic with modal operators and coimpl...
متن کاملRasiowa-Sikorski deduction systems in computer science applications
A Rasiowa-Sikorski system is a sequence-type formalization of logics. The system uses invertible decomposition rules which decompose a formula into sequences of simpler formulae whose validity is equivalent to validity of the original formula. There may also be expansion rules which close indecomposable sequences under certain properties of relations appearing in the formulae, like symmetry or ...
متن کامل